منابع مشابه
Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: the case of generalized stars and double generalized stars
We characterize the possible lists of ordered multiplicities among matrices whose graph is a generalized star (a tree in which at most one vertex has degree greater than 2) or a double generalized star. Here, the inverse eigenvalue problem for symmetric matrices whose graph is a generalized star is settled. The answer is consistent with a conjecture that determination of the possible ordered mu...
متن کاملGeneralized Compressed Tree Machines
In this paper we propose a new class of tree machines, called generalized compressed tree machines. Generalized compressed tree machines are obtained from complete binary tree machines by performing certain`con-traction' operations. A generalized compressed tree machine of height h has approximately 25% less number of processors than a complete binary tree of height h. We show that these machin...
متن کاملGeneralized Tree-Adjoining Grammar
This paper continues a program extending results related to the descriptive characterization of the CFLs in terms of deenability in the weak monadic second-order theory of trees to the TALs and the entire hierarchy of Weir's Control Languages. Previously, we have shown that the languages in this hierarchy can be characterized by deenability in the weak monadic second-order theories of a general...
متن کاملAttacking Generalized Tree Alignment
Many multiple alignment methods implicitly or explicitly try to minimize the amount of biological change implied by an alignment. At the level of sequences, biological change is measured along a phylogenetic tree, a structure frequently being predicted only after the multiple alignment instead of together with it. The Generalized Tree Alignment problem addresses both questions simultaneously. I...
متن کاملGeneralized Groups that Distribute over Stars
In the paper “Groups that Distribute over Mathematical Structures”, [5], we stated that a group (S, ·) on a set S left (or right) distributes over an arbitrary mathematical structure (S, ∗) on the same set S if and only if respectively for all fixed t ∈ S the permutation Lt (x) = t · x (or Rt (x) = x · t) is a similarity mapping on (S, ∗). A similarity mapping f on (S, ∗) is a permutation on S ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2013
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v87i1.8